aximal Tractable
نویسندگان
چکیده
This paper continues Nebel and Biirckert’s investigation of Allen’s interval algebra by presenting nine more maximal tractable subclasses of the algebra (provided that P # NP), in addition to their previously reported ORD-HO~PE subclass. Furthermore, twelve tractable subclasses are identified, whose maximality is not decided. Four of these can express the notion of sequentiality between intervals, which is not possible in the ORD-Horn algebra. The satisfiability algorithm, which is common for all the algebras, is shown to be linear.
منابع مشابه
Hormonal Regulation of Acetylcholinesterase in an Epithelial Cell Line from Chironomus tentans
A cetylcholinesterase (A chE) can be induced in a non-neuronal, epithelial cell line from Chi ronomus tentans by the m oulting horm one 20-OH-ecdysone. M aximal response is reached a ft er 7 days. The increase in enzym atic activity can be suppressed by sim ultaneous incubation with inhibitors o f transcrip tion and translation . The potency o f various steroid horm ones to induce AchE coinci...
متن کاملOn some tractable classes in deduction and abduction
We address the identification of propositional theories for which entailment is tractable, so that every query about logical consequences of the theory can be answered in polynomial time. We map tractable satisfiability classes to tractable entailment classes, including hierarchies of tractable problems; and show that some initially promising conditions for tractability of entailment, proposed ...
متن کاملDetecting and Exploiting Subproblem Tractability
Constraint satisfaction problems may be nearly tractable. For instance, most of the relations in a problem might belong to a tractable language. We introduce a method to take advantage of this fact by computing a backdoor to this tractable language. The method can be applied to many tractable classes for which the membership test is itself tractable. We introduce therefore two polynomial member...
متن کاملTractable Disjunctive Constraints
Many combinatorial search problems can be expressed as `constraint satisfaction problems', and this class of problems is known to be NP-complete in general. In this paper we investigatèdisjunctive constraints', that is, constraints which have the form of the disjunc-tion of two constraints of speciied types. We show that when the constraint types involved in the disjunction have a certain prope...
متن کاملInformation Covariance Matrices for Multivariate Burr III and Logistic Distributions
Main result of this paper is to derive the exact analytical expressions of information and covariance matrices for multivariate Burr III and logistic distributions. These distributions arise as tractable parametric models in price and income distributions, reliability, economics, Human population, some biological organisms to model agricultural population data and survival data. We showed that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999